#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int n;
int a[N], f[N], g[N];

int main() {
    n = 1;
    while (cin >> a[n]) n ++ ;
    
    int res = 0;
    for (int i = 1; i < n; ++ i) {
        f[i] = 1;
        for (int j = 1; j < i; ++ j) 
            if (a[i] <= a[j]) f[i] = max(f[i], f[j] + 1);
        res = max(res, f[i]);
    }
    cout << res << endl;
    
    int cnt = 0;
    for (int i = 1; i < n; ++ i) {
        int k = 0;
        while (k < cnt && a[i] > g[k]) k ++ ;
        g[k] = a[i];
        if (k == cnt) cnt ++ ;
    }
    cout << cnt << endl;
    
    return 0;
}